C4ISR中基于XML的标准化作战文书与数据库的映射

基于XML的标准化作战文书有利于C4ISR应用或仿真系统中作战文书的网络动态数据传输;而要实现C4ISR中作战文书自动化处理的其他功能,还需把XML文档和成熟的关系数据库的互补功能结合起来.通过对作战文书标准化系统整体流程的分析,提出了用标准化作战文书的DTD文档作为连接关系数据库和XML文档的中间件,并给出了XML文档结构和关系数据库结构相互之间的转换机制.     

营房管理可视化系统设计方案

利用地理信息技术、数据库技术以及办公自动化技术提出了营房可视化管理系统设计方案,实现了空间数据的上传下载以及与营地实力系统数据的导入导出;并根据面向对象技术实现了对空间图层类、信息窗体类和属性数据维护类的封装,为改变传统的营房管理模式,实现营房的信息化、可视化管理作了一定的探讨。     

基于面向对象技术的通信资源管理数据库建模

采用面向对象技术进行数据模型构造是一种非传统的数据组织和设计方法 ,它能够更好地描述和分析现实世界事物之间的关系。论述了通信资源数据库的面向对象建模方法 ,并提出了一种面向对象数据模型向数据库结构转换的策略。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

大型飞行器制导与姿态控制联合仿真建模研究

针对固体火箭发动机、机动发射的大型飞行器的特点 ,提出了建立大姿态情况下全量、全干扰、非线性、时变的制导与姿态控制联合仿真数学模型的一般方法。以某型号固体发动机、机动发射的飞行器为背景 ,在综合考虑了控制系统动态特性和飞行器质心运动、绕质心运动、变质量特性、弹性振动特性、风干扰等因素的情况下 ,建立了飞行器的联合仿真数学模型。进而在面向对象仿真环境下 ,建立了直观、形象、易理想、易扩充的面向对象的飞行器联合仿真模型。仿真结果表明所建联合仿真模型是正确和有效的     

作战指挥系统软件动态定义和动态重组设计

对作战指挥系统软件的功能模块进行分析,引入软件构件开发的思想,采用COM/DCOM构件技术,在现有软件系统中增加远程管理构件,通过客户端程序对远程服务器管理构件的访问,动态管理远程机器上运行的作战指挥系统软件功能模块,使得作战指挥系统软件的各个功能模块能够稳定运行,使分布式作战指挥系统软件具有动态定义、动态重组、动态管理等功能,大大提高了作战指挥系统软件的可靠性和可交互性,使作战指挥系统软件达到了互连、互通、互操作性的目的.